منابع مشابه
Persistent Topology of Syntax
We study the persistent homology of the data set of syntactic parameters of the world languages. We show that, while homology generators behave erratically over the whole data set, non-trivial persistent homology appears when one restricts to specific language families. Different families exhibit different persistent homology. We focus on the cases of the Indo-European and the Niger-Congo famil...
متن کاملBarcodes: the Persistent Topology of Data
This article surveys recent work of Carlsson and collaborators on applications of computational algebraic topology to problems of feature detection and shape recognition in high-dimensional data. The primary mathematical tool considered is a homology theory for point-cloud data sets—persistent homology—and a novel representation of this algebraic characterization— barcodes. We sketch an applica...
متن کاملThe Topology of Syntax Relations of a Formal Language
The method of constructing of Grothendieck’s topology basing on a neighbourhood grammar, defined on the category of syntax diagrams is described in the article. Syntax diagrams of a formal language are the multigraphs with nodes, signed by symbols of the language’s alphabet. The neighbourhood grammar allows to select correct syntax diagrams from the set of all syntax diagrams on the given alpha...
متن کاملPersistent topology for cryo-EM data analysis.
In this work, we introduce persistent homology for the analysis of cryo-electron microscopy (cryo-EM) density maps. We identify the topological fingerprint or topological signature of noise, which is widespread in cryo-EM data. For low signal-to-noise ratio (SNR) volumetric data, intrinsic topological features of biomolecular structures are indistinguishable from noise. To remove noise, we empl...
متن کاملVerb Cluster, Non-Projectivity, and Syntax-Topology Interface in Korean
This article proposes a simple modeling of Korean word order within the framework of the topological dependency grammar – the first topological modeling for this language – a system of formal rules accounting for the correspondence between the dependency tree of a sentence and an ordered constituent structure. We show that a fairly small number of linearization rules can account for the word or...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics in Computer Science
سال: 2017
ISSN: 1661-8270,1661-8289
DOI: 10.1007/s11786-017-0329-x